Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ti.\*:("STACS 98 : 15th annual symposium on theoretical aspects of computer science (Paris, 25-27 February 1998)")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 54

  • Page / 3
Export

Selection :

  • and

STACS 98 : 15th annual symposium on theoretical aspects of computer science (Paris, 25-27 February 1998)Morvan, Michel; Meinel, Christoph; Krob, Daniel et al.Lecture notes in computer science. 1998, issn 0302-9743, isbn 3-540-64230-7, XV, 630 p, isbn 3-540-64230-7Conference Proceedings

Complexity of problems on graphs represented as OBDDsFEIGENBAUM, J; KANNAN, S; VARDI, M. Y et al.Lecture notes in computer science. 1998, pp 216-226, issn 0302-9743, isbn 3-540-64230-7Conference Paper

On disguised double horn functions and extensionsEITER, T; IBARAKI, T; MAKINO, K et al.Lecture notes in computer science. 1998, pp 50-60, issn 0302-9743, isbn 3-540-64230-7Conference Paper

On the structure of Valiant's complexity classesBÜRGISSER, P.Lecture notes in computer science. 1998, pp 194-204, issn 0302-9743, isbn 3-540-64230-7Conference Paper

On uniform DOL wordsFRID, A. E.Lecture notes in computer science. 1998, pp 544-554, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Partially persistent search trees with transcript operationsLARSEN, K. S.Lecture notes in computer science. 1998, pp 309-319, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Series-parallel posets : Algebra, automata and languagesLODAYA, K; WEIL, P.Lecture notes in computer science. 1998, pp 555-565, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Axiomatizing the equational theory of regular tree languagesESIK, Z.Lecture notes in computer science. 1998, pp 455-465, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Hierarchies of principal twist-closed triosJANTZEN, M.Lecture notes in computer science. 1998, pp 344-355, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Interactive protocols on the realsIVANOV, S; DE ROUGEMONT, M.Lecture notes in computer science. 1998, pp 499-510, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Nearly optimal language compression using extractorsFORTNOW, L; LAPLANTE, S.Lecture notes in computer science. 1998, pp 84-93, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Relating hierarchies of word and tree automataNIWINSKI, D; WALUKIEWICZ, I.Lecture notes in computer science. 1998, pp 320-331, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Distributed online frequency assignment in cellular networksJANSSEN, J; KRIZANC, D; NARAYANAN, L et al.Lecture notes in computer science. 1998, pp 3-13, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Optimal simulations between unary automataMEREGHETTI, C; PIGHIZZINI, G.Lecture notes in computer science. 1998, pp 139-149, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Provable security for block ciphers by decorrelationVAUDENAY, S.Lecture notes in computer science. 1998, pp 249-275, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Random sparse bit strings at the threshold of adjacencySPENCER, J. H; JOHN, K. S.Lecture notes in computer science. 1998, pp 94-104, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Recursively enumerable reals and Chaitin Ω numbersCALUDE, C. S; HERTLING, P. H; KHOUSSAINOV, B et al.Lecture notes in computer science. 1998, pp 596-606, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Simplifying the modal Mu-calculus alternation hierarchyBRADFIELD, J. C.Lecture notes in computer science. 1998, pp 39-49, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Sorting and searching on the word RAMHAGERUP, T.Lecture notes in computer science. 1998, pp 366-398, issn 0302-9743, isbn 3-540-64230-7Conference Paper

The complexity of modular Graph AutomorphismARVIND, V; BEIGEL, R; LOZANO, A et al.Lecture notes in computer science. 1998, pp 172-182, issn 0302-9743, isbn 3-540-64230-7Conference Paper

A generalization of resource-bounded measure, with an applicationBUHRMAN, H; VAN MELKEBEEK, D; REGAN, K. W et al.Lecture notes in computer science. 1998, pp 161-171, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Attractors of D-dimensional linear cellular automataMANZINI, G; MARGARA, L.Lecture notes in computer science. 1998, pp 128-138, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Uniformly defining complexity classes of functionsKOSUB, S; SCHMITZ, H; VOLLMER, H et al.Lecture notes in computer science. 1998, pp 607-617, issn 0302-9743, isbn 3-540-64230-7Conference Paper

A logical characterization of systolic languagesMONTI, A; PERON, A.Lecture notes in computer science. 1998, pp 466-476, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Cell flipping in permutation diagramsGOLUMBIC, M. C; KAPLAN, H.Lecture notes in computer science. 1998, pp 577-586, issn 0302-9743, isbn 3-540-64230-7Conference Paper

  • Page / 3